Synchronizability of random rectangular graphs.
نویسندگان
چکیده
Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.
منابع مشابه
Synchronization in small-world systems.
We quantify the dynamical implications of the small-world phenomenon by considering the generic synchronization of oscillator networks of arbitrary topology. The linear stability of the synchronous state is linked to an algebraic condition of the Laplacian matrix of the network. Through numerics and analysis, we show how the addition of random shortcuts translates into improved network synchron...
متن کاملEnhancing synchronizability of weighted dynamical networks using betweenness centrality.
By considering the eigenratio of the Laplacian of the connection graph as a synchronizability measure, we propose a procedure for weighting dynamical networks to enhance their synchronizability. The method is based on node and edge betweenness centrality measures and is tested on artificially constructed scale-free, Watts-Strogatz, and random networks as well as on some real-world graphs. It is...
متن کاملSynchronizability and Connectivity of Discrete Complex Systems
The synchronization of discrete complex systems is critical in applications such as communication and transportation networks, neuron respiratory systems, and other systems in which either congestion can occur at individual nodes, or system wide synchrony is of importance to proper functionality. The first non-trivial eigenvalue of a network’s Laplacian matrix, called the algebraic connectivity...
متن کاملNetwork synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network’s corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs.
متن کاملAnalysis and Control of Network Synchronizability *
In this paper, the investigation is first motivated by showing two examples of simple regular symmetrical graphs, which have the same structural parameters, such as average distance, degree distribution and node betweenness centrality, but have very different synchronizabilities. This demonstrates the complexity of the network synchronizability problem. For a given network with identical node d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Chaos
دوره 25 8 شماره
صفحات -
تاریخ انتشار 2015